A Simple Churn-Tolerant Structured Peer-to-Peer Scheme

We present a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to “convert” a static network into a dynamic distributed hash table(DHT)-based P2P network such that all the good properties of the static network are guaranteed with high probability. Applying our scheme to a cube-connected cycles network, for example, yields a O(log N) degree network, in which every search succeeds in O(log N) hops w.h.p., using O(log N) messages, where N is the expected stable network size. Our scheme has an O(log N) storage overhead (the number of nodes responsible for servicing a data item) and an O(log N) overhead (messages and time) per insertion and no overhead for deletions. All these bounds are essentially optimal.